Comprehensive Review on Shortest Path Algorithms in Networks

In this paper the shortest-path problem in networks is considered in which the delay (or weight) of the edges changes with time acc or ding to arbitrary functions. The author studied algorithms for finding the shortest-path and minimum delay under various waiting constraints and investigate the proper ties of the derived path. We show that if departure time from the source node is unrestricted then a shortest path ca n be found that is simple and achieves a delay as short as the most unrestricted path. In the case of restricted transit, it is shown that there exist cases where the minimum delay is finite but the path that achieves it is infinite.